Proling-by-Association: A Resilient Trafc Proling Solution for the Internet Backbone

نویسندگان

  • Marios Iliofotou
  • Brian Gallagher
  • Tina Eliassi-Rad
  • Guowu Xie
  • Michalis Faloutsos
چکیده

Proling Internet backbone trafc is becoming an increasingly hard problem since users and applications are avoiding detection using trafc obfuscation and encryption. The key question addressed here is: Is it possible to profile traffic at the backbone without relying on its packet and flow level information, which can be obfuscated? We propose a novel approach, called Proling-By-Association (PBA), that uses only the IP-to-IP communication graph and information about some applications used by few IP-hosts (a.k.a. seeds). The key insight is that IP-hosts tend to communicate more frequently with hosts involved in the same application forming communities (or clusters). Proling few members within a cluster can “give away” the whole community. Following our approach, we develop different algorithms to prole Internet trafc and evaluate them on real-traces from four large backbone networks. We show that PBA’s accuracy is on average around 90% with knowledge of only 1% of all the hosts in a given data set and its runtime is on the order of minutes (≈ 5).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pretenuring Based on Escape Analysis

Our hypothesis is that es ape analysis an estimate lifetime information for dynami ally allo ated obje ts. We then use this information to pretenure those obje ts that have long lifetimes. This te hnique avoids the ost in urred by a generational opying olle tor for opying long-lived obje ts from the nursery into an older generation. This approa h is ompletely new { all past work on pretenuring ...

متن کامل

Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design

The two main alternatives for achieving high QoS on the public internet are (i) admission control and (ii) capacity overprovisioning. In the study of these alternatives the implicit (and sometimes explicit) message is that ideally, QoS issues should be dealt with by means of sophisticated admission control (AC) algorithms, and only because of their complexity providers fall on the simpler, perh...

متن کامل

ROMER: Resilient Opportunistic Mesh Routing for Wireless Mesh Networks

Wireless mesh networks hold promises to provide robust and high-throughput data delivery to wireless users. In a mesh network, high-speed Access Points (HAPs), equipped with advanced antennas, communicate with each other over wireless channels and form an indoor/outdoor broadband backhaul. This backbone efficiently forwards user traffic to a few gateway APs (GAPs), which additionally have high-...

متن کامل

Implementation of the Multiclass Priority Fair Queuing (MPFQ) Algorithm for Extending Quality of Service in Existing Backbones to Wireless Endpoints

This paper presents the implementation of a wireless scheduling algorithm that provides backbone Quality of Service (QoS) support to mobile stations. The algorithm described in this paper maps all existing ATM tra c types into priorities and weights for a Multiclass Priority Fair Queue (MPFQ) scheduler. The MPFQ scheduler is designed to operate in a wireless base station. A prototype driver has...

متن کامل

Measurements and Control of QoS Final Report

| Internet applications from voice to web browsing must be protected from performance degradations caused by network congestion. The challenge is to design admission control, bandwidth management, and resource provisioning procedures so that as many connections as possible can be carried without violating the QoS (quality of service) guaranteed to or expected by users. We consider the relations...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010